Allocating servers in infostations for bounded simultaneous requests

Allocating servers in infostations for bounded simultaneous requests

Allocating Servers in Infostations for On-Demand Communications

Given a set of servic e requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each category c, the Server A llocation with Bounded Simultaneous Requests problem consists in assigning a server to each request in such a way that at most k mutually simultaneous requests are assigned to the same server at the same time, out of which at most hc are...

Eecient Algorithms for Predicting Requests to Web Servers

| Internet traac has grown signiicantly with the popularity of the Web. Consequently user perceived latency in retrieving web pages has increased. Caching and prefetch-ing at the client side, aided by hints from the server, are attempts at solving this problem. We suggest techniques to group resources that are likely to be accessed together into volumes, which are used to generate hints tailore...

Efficient Algorithms for Predicting Requests to Web Servers

Internet traac has grown signiicantly with the popularity of the Web; consequently user perceived latency in retrieving web pages has increased. Caching and prefetching at the client side aided by hints from the server are attempts at solving this problem. We suggest techniques to group resources that are likely to be accessed together into volumes, which are used to generate hints tailored to ...

Price of Fairness for Allocating a Bounded Resource

In this paper we study the problem of allocating a scarce resource among several players (or agents). A central decision maker wants to maximize the total utility of all agents. However, such a solution may be unfair for one or more agents in the sense that it can be achieved through a very unbalanced allocation of the resource. On the other hand fair/balanced allocations may be far from being ...